Random solids and random solidification: what can be learned by exploring systems obeying permanent random constraints?
نویسندگان
چکیده
منابع مشابه
Random solids and random solidification: what can be learned by exploring systems obeying permanent random constraints?
In many interesting physical settings, such as the vulcanization of rubber, the introduction of permanent random constraints between the constituents of a homogeneous fluid can cause a phase transition to a random solid state. In this random solid state, particles are permanently but randomly localized in space, and a rigidity to shear deformations emerges. Owing to the permanence of the random...
متن کاملRandom Solidiication and Random Solids: What Can Be Learned by Exploring Systems Obeying Permanent Random Constraints? Random Solidiication and Random Solids 2
In many interesting physical settings, such as the vulcanization of rubber, the introduction of permanent random constraints between the constituents of a homogeneous uid can cause a phase transition to a random solid state. In this random solid state, particles are permanently but randomly localized in space, and a rigidity to shear deformations emerges. Owing to the permanence of the random c...
متن کاملSupport vector regression with random output variable and probabilistic constraints
Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...
متن کاملWhat Can be Efficiently Reduced to the K-Random Strings?
We investigate the question of whether one can characterize complexity classes in terms of efficient reducibility to the set of Kolmogorov-random strings RK. We show that this question is dependent on the choice of universal machine in the definition of Kolmogorov complexity. We show for a broad class of reductions that the sets reducible to RK have very low computational complexity. Further, w...
متن کاملWhat Can be Efficiently Reduced to the Kolmogorov-Random Strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings RC. We show that this question cannot be posed without explicitly dealing with issues raised by the choice of universal machine in the definition of Kolmogorov complexity. Among other results, we show that although for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Condensed Matter
سال: 2000
ISSN: 0953-8984,1361-648X
DOI: 10.1088/0953-8984/12/29/330